GPU Accelerated Smith-Waterman
نویسندگان
چکیده
We present a novel hardware implementation of the double affine Smith-Waterman (DASW) algorithm, which uses dynamic programming to compare and align genomic sequences such as DNA and proteins. We implement DASW on a commodity graphics card, taking advantage of the general purpose programmability of the graphics processing unit to leverage its cheap parallel processing power. The results demonstrate that our system’s performance is competitive with current optimized software packages.
منابع مشابه
Acceleration of the Smith-Waterman algorithm using single and multiple graphics processors
Finding regions of similarity between two very long data streams is a computationally intensive problem referred to as sequence alignment. Alignment algorithms must allow for imperfect sequence matching with different starting locations and some gaps and errors between the two data sequences. Perhaps the most well known application of sequence matching is the testing of DNA or protein sequences...
متن کاملGPU-SW Sequence Alignment server
We present a complete sequence homology search server based on the hybrid CPU/GPU implementation of the Smith Waterman algorithm for sequence alignment. We discuss system architecture, division of the tasks between CPU and GPU in the hybrid design, the scalability issues and hardware requirements. The performance of the server is compared with the state-ofthe-art sequence analysis servers. Bioi...
متن کاملFast Sequence Alignment Method Using CUDA-enabled GPU
Sequence alignment is a task that calculates the degree of similarity between two sequences. Given a query sequence, finding a database sequence which is most similar to the query by sequence alignment is the first step in bioinformatics research. The first sequence alignment algorithm was proposed by Needleman and Wunsch. They got the optimal global alignment by using dynamic programming metho...
متن کاملAccelerating the Smith-Waterman Algorithm for Bio-sequence Matching on GPU
Nowadays, GPU has emerged as one promising computing platform to accelerate bio-sequence analysis applications by exploiting all kinds of parallel optimization strategies. In this paper, we take a well-known algorithm in the field of pair-wise sequence alignment and database searching, the Smith-Waterman (S-W) algorithm as an example, and demonstrate approaches that fully exploit its performanc...
متن کاملComputing Privacy-Preserving Edit Distance and Smith-Waterman Problems on the GPU Architecture
This paper presents privacy-preserving, parallel computing algorithms on a graphic processing unit (GPU) architecture to solve the Edit-Distance (ED) and the Smith-Waterman (SW) problems. The ED and SW problems are formulated into dynamic programming (DP) computing problems, which are solved using the Secure Function Evaluation (SFE) to meet privacy protection requirements, based on the semi-ho...
متن کامل